Real-Time Scheduling of Concurrent Transactions in Multidomain Ring Buses
نویسندگان
چکیده
منابع مشابه
Real-time Scheduling on Multi-domain Ring Buses
This paper addresses the problem of scheduling real-time data transactions on the bus of multicore processors. The problem is challenging because the bus allows multiple degrees of transaction concurrency. The number of concurrency degrees depends on how the transactions are routed on the bus. We propose an practical abstraction for the scheduling problem together with two scheduling algorithms...
متن کاملScheduling Adaptive Transactions in Real-Time Databases
A new transaction model, called the Adaptive Transaction Model, is proposed for Real-Time Database Management Systems (RTDBMSs) applications. The Adaptive Transaction Model is an extended transaction model with a nested structure containing optional and required subtransactions. Adaptive Transactions (ATs) have time constraints to support real-time database applications. Optional substransactio...
متن کاملScheduling transactions with stringent real-time constraints
Many real-time database systems (RTDBS) are used to support mission-critical applications such as avionics control systems and defense systems, in which transactions have stringent real-time constraints. In these hard real-time systems, a transaction missing its deadline could lead to catastrophic consequences. The difficulties of providing a guarantee of meeting transaction deadlines in hard...
متن کاملReal-time scheduling of transactions in multicore systems
Transactional memory has attracted much interest for multicore systems as it eases programming and avoids the problems of lock-based methods. However, introducing real-time scheduling of transactions in multicore systems is an open problem. Existing solutions for real-time scheduling consider either tasks in multiprocessor systems or transactions in database systems. In this paper, we show that...
متن کاملUtilization of execution histories in scheduling real-time database transactions
Real-time database systems support data processing needs of real-time systems where transactions have time constraints. Here we consider repetitively executed transactions, and assume that execution histories are logged. A well-known priority assignment technique called earliest-deadline-first is biased towards short transactions in which short transactions have better chances of completing the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2012
ISSN: 0018-9340
DOI: 10.1109/tc.2011.151